On intriguing sets in five classes of strongly regular graphs

نویسندگان

چکیده

In this paper, we construct intriguing sets in five classes of strongly regular graphs defined on nonisotropic points finite classical polar spaces, and determine their intersection numbers.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intriguing Sets of Vertices of Regular Graphs

Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with these notions. Indeed, we show that some of the results obtained earlier can be generalized to larger classes of graphs. We also give some connections and relations with other notions and results from algebraic graph th...

متن کامل

Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes

In this paper, we give a construction of strongly regular Cayley graphs and a construction of skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and they generalize the constructions given by Feng and Xiang [10, 12]. Three infinite families of strongly regular graphs with new parameters are obtained. The main tools that we employed are i...

متن کامل

Strongly Regular Graphs from Union of Cyclotomic Classes

We give two constructions of strongly regular Cayley graphs on finite fields Fq by using union of cyclotomic classes and index 2 Gauss sums. In particular, we obtain twelve infinite families of strongly regular graphs with new parameters.

متن کامل

Strongly regular graphs from unions of cyclotomic classes

Article history: Received 24 August 2010 Available online 8 November 2011

متن کامل

Counting Independent Sets in Some Classes of (almost) Regular Graphs

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some cases, construct the corresponding bijections.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Designs

سال: 2022

ISSN: ['1520-6610', '1063-8539']

DOI: https://doi.org/10.1002/jcd.21832